Toward Practical Constraint Databases
ثبت نشده
چکیده
/.WI 01’ WII.+W~~/ t/n/~&rst s (l,(.:ljlIs) f7il.~d rc+tt~ioJJal tlill.ill~ilS~~h I.0 itlclll(lt* lillc*;r.r aritliiltc~(.ic* ccm4raint.ri it1 IHII~II rc~lal.iollx :i.iitl qlwric~s. A I,( ‘I)‘tl (‘itll dS0 bta vicwcstl as ii I)owc7ful c~xttriisioli of liucsar progratJJJlJiug (l,l’) wllc*rcs t.licb syst,c~ili of c:orinl.raiilh is gc~iieralixc~tl LB :I. (l~ll.iil~iW~ (.0lll.il.illill# coiisMinls alld LllC ol~.j&ive I’trilc*l.ioii is g(bric*r;iliz.cd lo a r&l.biOlii~l qufbry coutainillg ~~Oll~hillk. ollr llla,i(Jr COllCt’l’ll iS (luc’ry O~~t~iillixal~loll iii I,( !lIl)s. ‘I’ratli(,ioiJal tl~till)?Wt’ approach art’ IlOt. iUIt’<(II;rLt li)r ~~~Jlll~l~ll~.~~~Oll Wit.ll I,]’ te~h~~d~gy. IllSl.twi, WC* ~IIYJllOW a JWW qirr’ry optiiiiizatioil approach, IGIS(YI OII sl.ilt.isl.ical c\sGtJial,ioJis aJltl it8eratcbd Gals of ~~ol.c~ril.i;i.lly bot,tc*r cbvalual,ioiJ phris. ‘r’lw rcsoltitig alfioril.liJii~ il.rl' 1101, ouly c4l&tiw 0II IXI)Hs, ht. als0 011 c~hisl.iii~ (lii(q I;l.llguagw.
منابع مشابه
Constraint Stratification in Deductive Databases
We propose a syntactic condition on deductive database programs that ensures a two-valued well-founded model. This condition, called constraint stratiication, is signiicantly more general than previous syntactic conditions such as stratiication and local stratiication. Modular stratiication has been proposed as a semantic (i.e., nonsyntactic) condition for ensuring a two-valued well-founded mod...
متن کاملAn Extended Algebra for Constraint
| Constraint relational databases use constraints to both model and query data. A constraint relation contains a nite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the speciic conjunction of constraints, it may possibly represent an in-nite set of relational tuples. For their ch...
متن کاملToward a General Language for the Specification of Constraint Satisfaction Problems
The past decade saw rapid progress toward prominence of constraint satisfaction technology. Many practical algorithms have been developed to solve larger and larger problems. The degree of maturity in this technology begs the support of well-established software engineering tools. This paper targets a formal specification language DEPICT 0.1 that can aid in the formulation of constraint satisfa...
متن کاملA practical mandatory access control model for XML databases
A practical mandatory access control (MAC) model for XML databases is presented in this paper. The label type and label access policy can be defined according to the requirements of different applications. In order to preserve the integrity of data in XML databases, a constraint between a read-access rule and a write-access rule in label access policy is introduced. Rules for label assignment a...
متن کاملOn the Orthographic Dimension of Constraint Databases
One of the most important advantages of constraint databases is their ability to represent and to manipulate data in arbitrary dimension within a uniform framework. Although the complexity of querying such databases by standard means such as rst-order queries has been shown to be tractable for reasonable constraints (e.g. polynomial), it depends badly (roughly speaking exponentially) upon the d...
متن کاملManipulating Spatial Data in Constraint Databases
Constraint databases have recently been proposed as a powerful framework to model and retrieve spatial data. In a constraint database , a spatial object is represented as a quantiier free conjunction of (usually linear) constraints, called generalized tuple. The set of solutions of such quantiier free formula represents the set of points belonging to the extension of the object. The relational ...
متن کامل